Routing graph management in autonomous vehicle routing

ABSTRACT

Various examples are directed to routing autonomous vehicles. A processor unit accesses first routing graph modification data and second routing graph modification data. The first routing graph modification data based at least in part on first vehicle capability data describing a first type of autonomous vehicle and the second routing graph modification data based at least in part on second vehicle capability data describing a second type of autonomous vehicle. The processor unit accesses routing graph data describing a plurality of graph elements and generates a first route for a first autonomous vehicle of the first type based at least in part on the first routing graph modification data and the routing graph data. The processor unit also generates a second route for a second autonomous vehicle of the second type based at least in part on the second routing graph modification data and the routing graph data.

CLAIM FOR PRIORITY

This application claims the benefit of priority of U.S. Application Ser. No. 62/771,545, filed Nov. 26, 2018, which is hereby incorporated by reference in its entirety.

FIELD

This document pertains generally, but not by way of limitation, to devices, systems, and methods for operating an autonomous vehicle.

BACKGROUND

An autonomous vehicle is a vehicle that is capable of sensing its environment and operating some or all of the vehicle's controls based on the sensed environment. An autonomous vehicle includes sensors that capture signals describing the environment surrounding the vehicle. The autonomous vehicle processes the captured sensor signals to comprehend the environment and automatically operates some or all of the vehicle's controls based on the resulting information.

DRAWINGS

In the drawings, which are not necessarily drawn to scale, like numerals may describe similar components in different views. Like numerals having different letter suffixes may represent different instances of similar components. Some embodiments are illustrated by way of example, and not of limitation, in the figures of the accompanying drawings.

FIG. 1 is a diagram showing one example of an environment for routing an autonomous vehicle.

FIG. 2 is a diagram showing another example of an environment for routing an autonomous vehicle.

FIG. 3 depicts a block diagram of an example vehicle according to example aspects of the present disclosure.

FIG. 4 is a flowchart showing one example of a process flow that can be executed by a routing engine to generate a route for an autonomous vehicle using routing graph modification data and a routing graph to generate a constrained routing graph.

FIG. 5 is a flowchart showing one example of a process flow that can be executed by a routing engine to generate a constrained routing graph using routing graph modification data.

FIG. 6 is a flowchart showing one example of a process flow that can be executed by a routing engine to generate a route using a routing graph and a pre-generated constrained routing graph.

FIG. 7 is a flowchart showing one example of a process flow that can be executed by a routing engine to generate a route using a routing graph and routing graph modification data, where a constrained routing graph is made while the route is being generated.

FIG. 8 is a flowchart showing one example of a process flow that can be executed by a routing engine to update a constrained routing graph upon receipt of new routing graph modification data.

FIG. 9 is a flowchart showing one example of a process flow that can be executed by a dispatch system or similar system to generate a route for an autonomous vehicle using routing graph modification data that varies by autonomous vehicle type.

FIG. 10 is a block diagram showing one example of a software architecture for a computing device.

FIG. 11 is a block diagram illustrating a computing device hardware architecture.

DESCRIPTION

Examples described herein are directed to systems and methods for routing an autonomous vehicle.

In an autonomous or semi-autonomous vehicle (collectively referred to as an autonomous vehicle (AV)), a vehicle autonomy system, sometimes referred to as an AV stack, controls one or more of braking, steering, or throttle of the vehicle. In a fully autonomous vehicle, the vehicle autonomy system assumes full control of the vehicle. In a semi-autonomous vehicle, the vehicle autonomy system assumes a portion of the vehicle control, with a human user (e.g., a vehicle operator) still providing some control input. Some autonomous vehicles can also operate in a manual mode, in which a human user provides all control inputs to the vehicle.

A vehicle autonomy system can control an autonomous vehicle along a route. A route is a path that the autonomous vehicle takes, or plans to take, over one or more roadways. The route for an autonomous vehicle is generated by a routing engine, which can be implemented onboard the autonomous vehicle or offboard the autonomous vehicle. The routing engine can be programmed to generate routes that optimize the time, danger, and/or other factors associated with driving on the roadways.

In some examples, the routing engine generates a route for the autonomous vehicle using a routing graph. The routing graph is a graph that represents roadways as a set of graph elements. A graph element is a component of a routing graph that represents a roadway element on which the autonomous vehicle can travel. A graph element can be or include an edge, node, or other component of a routing graph. A graph element represents a portion of roadway, referred to herein as a roadway element. A roadway element is a component of a roadway that can be traversed by a vehicle.

A roadway element be or include different subdivisions of a roadway, depending on the implementation. In some examples, the roadway elements are or include road segments. A road segment is a portion of roadway including all lanes and directions of travel. Consider a four-lane divided highway. A road segment of the four-lane divided highway includes a stretch of the highway including all four lanes and both directions of travel.

In some examples, roadway elements are or include directed road segments. A directed road segment is a portion of roadway where traffic travels in a common direction. Referring again to the four-lane divided highway example, a stretch of the highway would include at least two directed road segments: a first directed road segment including the two lanes of travel in one direction and a second directed road segment including the two lanes of travel in the other direction.

In some examples, roadway elements are or include lane segments. A lane segment is a portion of a roadway including one lane of travel in one direction. Referring again to the four-lane divided highway example, a portion of the divided highway may include two lane segments in each direction. Lane segments may be interconnected in the direction of travel and laterally. For example, a vehicle traversing a lane segment may travel in the direction to travel to the next connected lane segment or may make a lane change to move laterally to a different lane segment.

The routing graph includes data describing directionality and connectivity for the graph elements. The directionality of a graph element describes limitations (if any) on the direction in which a vehicle can traverse the roadway element corresponding to the graph element. The connectivity of a given graph element describes other graph elements to which the autonomous vehicle can be routed from the given graph element.

The routing graph can also include cost data describing costs associated with graph elements. The cost data indicates a cost to traverse a roadway element corresponding to a graph element or to transition between roadway elements corresponding to connected graph elements. Cost can be based on various factors including, for example, estimated driving time, danger risk, etc. In some examples, higher cost generally corresponds to more negative characteristics of a graph element or transition (e.g., longer estimated driving time, higher danger risk, etc.).

The routing engine determines a best route, for example, by applying a path-planning algorithm to the routing graph. Any suitable path-planning algorithm can be used, such as, for example, A*, D*, Focused D*, D* Lite, GD*, or Dijkstra's algorithm. The best route includes a string of connected graph elements between a vehicle start point and a vehicle end point. A vehicle start point is a graph element corresponding to the roadway element where a vehicle will begin a route. A vehicle end point is a graph element corresponding to the roadway element where the vehicle will end a route. Some routes also traverse one or more waypoints, where a waypoint is a graph element between the vehicle start point and the vehicle end point corresponding to a roadway element that the autonomous vehicle is to traverse on a route. In some examples, waypoints are implemented to execute a transportation service for more than one passenger or more than one cargo. For example, passengers and/or cargo may be picked up and/or dropped off at some or all of the waypoints. The best route identified by the path-planning algorithm may be the route with the lowest cost (e.g., the route that has the lowest cost or the highest benefit).

In various examples, it is desirable to configure a routing engine to cope with roadway conditions, vehicle capabilities, and sometimes even business policy preferences. For example, if a portion of a roadway is closed for construction, it is desirable that the routing engine avoid routing the autonomous vehicle through graph elements that correspond to the closed portion. Also, it is desirable that the routing engine avoid routing an autonomous vehicle through graph elements that include maneuvers that the autonomous vehicle is not capable of making. Further, it may be desirable for the routing engine to avoid routing autonomous vehicles through graph elements selected according to business policies, such as, for example, graph elements corresponding to roadway elements that are in school zones.

A routing graph can be constructed in view of different roadway conditions, vehicle capabilities, and/or policy preferences. For example, if a roadway condition makes a roadway element corresponding to a particular graph element impassable or less desirable, this can be reflected in the routing graph. For example, the routing graph may be constructed to omit the graph element, omit connectivity data describing transitions to and/or from the graph element, or increase a cost of traversing or transitioning to the graph element, etc.

Generating a custom routing graph for each unique permutation of roadway conditions, vehicle capabilities, policy preferences, or other considerations, however, can be costly and inefficient. For example, in some implementations a routing engine can be implemented centrally to generate routes for many different types of autonomous vehicles. Using a distinct routing graph for each type of vehicle can lead to inefficiencies related to data storage, data management, and other factors. Also, roadway conditions can change over time. Modifying a routing graph every time that there is a change in a roadway condition can be cumbersome. Also, it may be desirable to modify business policies over time and, sometimes, even for different vehicle types. Again, modifying routing graphs for every business policy change can be cumbersome and inefficient.

Various examples described herein are directed to routing autonomous vehicles utilizing a routing graph and routing graph modification data. The routing graph is a general-purpose routing graph that is usable for different types of autonomous vehicles, different business policies, and/or different roadway conditions. Routing graph modification data can be applied to the general-purpose routing graph either before or during routing to generate a constrained routing graph. A routing engine applies the constrained routing graph to generate routes for a particular type of autonomous vehicle, a particular set of roadway conditions, a particular set of policies, etc. Further, if roadway conditions, vehicle capabilities, policies, etc. change, it may not be necessary to create new routing graphs. Instead, routing graph modification data is created and/or modified to reflect changes.

Routing graph modification data can describe one or more routing graph modifications. A routing graph modification is a change to a routing graph (e.g., a general-purpose routing graph) that reflects various factors including, for example, capabilities of the vehicle that is to execute a route, current roadway conditions, business policy considerations, and so on. A routing graph modification includes a graph element descriptor and a constraint.

A graph element descriptor is data describing one or more graph elements that are the subject of a routing graph modification. For example, a graph element descriptor can describe graph elements using one or more graph element properties. A graph element property is anything that describes a graph element and/or its corresponding roadway element. Example graph element properties include, for example, a unique identifier for the graph element, a roadway type of the corresponding roadway element (e.g., divided highway, urban street, etc.), a driving rule of the roadway element associated with the graph element (e.g., speed limit, access limitations), a type of maneuver necessary to enter, exit, and/or traverse the corresponding roadway element, whether the corresponding roadway element leads to a specific type of roadway element (e.g., dead end, divided highway, etc.), and so on.

In some examples, a graph element descriptor is expressed as a predicate. A predicate is a question that has a binary answer. For example, a graph element descriptor expressed as a predicate may identify a predicate graph element property. If a graph element is described by the predicate graph element property, then the constraint is applied to that graph element. An example predicate graph element descriptor may include an assertion that a graph element has a speed limit greater than 35 miles per hour (mph). The constraint may be applied to graph elements that are described by the predicate graph element descriptor and not applied to graph elements that are not described by the predicate graph element.

A constraint is an action applied to graph elements at a routing graph that are described by the graph element descriptor of a routing graph modification. Example constraints that may be applied to a graph element include removing the graph element from the routing graph, modifying (e.g., removing) transitions to or from a graph element, changing a cost associated with a graph element or transitions involving the graph element, etc. Another example routing graph modification can include changing a required or recommended autonomous vehicle mode. For example, a graph element can be modified to indicate that an autonomous vehicle traversing the roadway element corresponding to the graph element should be operated in a semi-autonomous or manual mode.

FIG. 1 is a diagram showing one example of an environment 100 for routing an autonomous vehicle. The environment 100 includes a vehicle 102. The vehicle 102 can be a passenger vehicle such as a car, a truck, a bus, or another similar vehicle. The vehicle 102 can also be a delivery vehicle, such as a van, a truck, a tractor trailer, etc. The vehicle 102 is a self-driving vehicle (SDV) or autonomous vehicle (AV). The vehicle 102 includes a vehicle autonomy system, described in more detail with respect to FIG. 3, that is configured to operate some or all of the controls of the vehicle 102 (e.g., acceleration, braking, steering).

In some examples, the vehicle 102 is operable in different modes, where the vehicle autonomy system has differing levels of control over the vehicle 102 in different modes. In some examples, the vehicle 102 is operable in a fully autonomous mode in which the vehicle autonomy system has responsibility for all or most of the controls of the vehicle 102. In addition to or instead of the fully autonomous mode, the vehicle autonomy system, in some examples, is operable in a semi-autonomous mode in which a human user or driver is responsible for some control of the vehicle 102. The vehicle 102 may also be operable in a manual mode in which the human user is responsible for all control of the vehicle 102. Additional details of an example vehicle autonomy system are provided in FIG. 3.

The vehicle 102 has one or more remote-detection sensors 106 that receive return signals from the environment 100. Return signals may be reflected from objects in the environment 100, such as the ground, buildings, trees, etc. The remote-detection sensors 106 may include one or more active sensors, such as LIDAR, RADAR, and/or SONAR sensors, that emit sound or electromagnetic radiation in the form of light or radio waves to generate return signals. The remote-detection sensors 106 can also include one or more passive sensors, such as cameras or other imaging sensors, proximity sensors, etc., that receive return signals that originated from other sources of sound or electromagnetic radiation. Information about the environment 100 is extracted from the return signals. In some examples, the remote-detection sensors 106 include one or more passive sensors that receive reflected ambient light or other radiation, such as a set of monoscopic or stereoscopic cameras. The remote-detection sensors 106 provide remote-detection sensor data that describes the environment 100. The vehicle 102 can also include other types of sensors, for example, as described in more detail with respect to FIG. 3.

The environment 100 also includes a dispatch system 104 executing a routing engine 108. The dispatch system 104 can be configured to generate routes for multiple autonomous vehicles of different types including, for example, the vehicle 102 and vehicles 120, 122, 124 described in more detail herein. In some examples, the dispatch system 104 dispatches transportation services in which the vehicles 102, 120, 122, 124 pick up and drop off passengers, cargo, or other material. Examples of cargo or other material can include, food, material goods, and the like.

The dispatch system 104 can include one or more servers or other suitable computing devices that execute the routing engine 108. The routing engine 108 is programmed to generate routes for the various vehicles 102, 120, 122, 124 utilizing a routing graph and routing graph modification data, as described herein. In some examples, routes generated by the routing engine 108 are provided to one or more of the vehicles 102, 120, 122, 124. For example, the dispatch system 104 can provide a route to the vehicle 102, 120, 122, 124 with an instruction that the vehicle 102, 120, 122, 124 begin traveling the route.

In some examples, the dispatch system 104 generates routes for the vehicles 102, 120, 122, 124 and uses the generated routes to determine whether to offer a transportation service to a particular vehicle 102, 120, 122, 124. For example, the dispatch system 104 can receive a request for a transportation service between a vehicle start point and a vehicle end point. The dispatch system 104 can use the routing engine 108 to generate routes for executing the transportation service for multiple vehicles 102, 120, 122, 124. The dispatch system 104 can offer the transportation service to the vehicle 102, 120, 122, 124 having the most favorable (e.g., lowest-cost) route for executing the transportation service. If the vehicle accepts the transportation service, the dispatch system 104 may provide the generated route to the vehicle, or the vehicle can generate its own route for executing the transportation service.

The routing engine 108 can generate routes utilizing, for example, a routing graph 116 in conjunction with routing graph modification data describing routing graph modifications to be applied to the routing graph 116 to generate a constrained routing graph 109. In some examples, routing graph modifications are based on various input data such as, for example, business policy data 114, vehicle capability data 110, and/or roadway condition data 112. The routing engine 108 accesses the routing graph 116 and/or other data in any suitable manner. In some examples, the routing graph 116 and/or other data 110, 112, 114 is stored at a data storage device associated with the dispatch system 104. Also, in some examples, the routing graph 116 and/or other data 110, 112, 114 routing graph modification data can be received from another source or system. For example, the vehicle capability data 110 can be, or be derived from, operational domain (OD) data or operational design domain (ODD) data provided by the manufacturer of the vehicle 102 or of its vehicle autonomy system.

FIG. 1 shows a graphical representation 118 including various interconnected roadways 119 that are represented by the routing graph 116.

A break-out window 103 shows example graph elements 126A-126D to illustrate additional details of the example routing graph 116. Graph elements in the break-out window 103 correspond to the indicated portion of the roadways 119. The graph elements, including graph elements 126A-126D are illustrated as shapes with arrows indicating the directionality of the graph elements. Graph elements can be connected to one another according to their directionality. For example, a vehicle can approach an intersection 127 by traversing a roadway element corresponding to an example graph element 126A. From there, vehicle can transition to an example graph element 126D, representing a path that proceeds straight through the intersection 127. The vehicle could also transition to a graph element 126B, representing a path that turns right at the intersection 127. In some examples, the vehicle can also transition from the graph element 126A to a graph element 126C, representing a path that changes lanes.

The routing engine 108 is configured to utilize the input data, such as the policy data 114, roadway condition data 112, and/or vehicle capability data 110, to generate routing graph modifications that are applied to the routing graph 116 to generate constrained routing graph 109 data. The constrained routing graph 109 data is used to generate a route. Generally, routing graph modification data for a particular routing graph modification includes a graph element descriptor describing a graph element or elements that are to be constrained and a constraint. The constraint can include, for example, removing graph elements having the indicated property or properties from the routing graph data 116, removing connections to graph elements described by the graph element descriptor, and/or changing a cost of graph elements described by the graph element descriptor. Another example routing graph modification can include changing a cost associated with a graph element and/or transitions to the graph element.

Costs may be changed up or down. For example, if routing graph modification data indicates that graph elements having a particular property or set of properties are disfavored, the costs to traverse and/or transition to the graph elements can be increased. On the other hand, if routing graph modification data indicates that graph elements having a particular property or set of properties are favored, the costs to traverse and/or transition to the graph elements can be decreased.

Constraints are applied to graph elements that meet the group element descriptor. For example, if a business policy forbids routing a vehicle through roadway elements that include or are in a school zone, a corresponding constraint includes removing the graph elements corresponding to school zone roadway elements from the routing graph 116 and/or removing transitions to such graph elements. Routing graph modifications can, in some examples, include constraints that are applied to graph elements other than those described by the graph element descriptor. Consider an example routing graph modification that is to avoid cul-de-sacs. The associated constraint could involve removing graph elements that correspond to cul-de-sacs and also removing graph elements that do not correspond to cul-de-sacs but do correspond to road segments that can lead only to cul-de-sacs.

The business policy data 114 can describe business policies that can be reflected in routing graph modifications. Business policies can describe types of roadway elements that it is desirable for a vehicle to avoid or prioritize. An example business policy is to avoid roadway elements that are in or pass through school zones. Another example business policy is to avoid routing vehicles through residential neighborhoods. Yet another example business policy is to favor routing vehicles on controlled-access highways, if available. Business policies can apply to some vehicles, some vehicle types, all vehicles, or all vehicle types.

The vehicle capability data 110 describes the capabilities of various different types of vehicle. For example, the dispatch system 104 can be programmed to generate routes for vehicles 102, 120, 122, 124 having different types of vehicle autonomy systems, different types of sensors, different software versions, or other variations. Vehicles of different types can have different capabilities. For example, a vehicle of one type may be capable of making all legal unprotected lefts. A vehicle of another type may be incapable of making unprotected lefts, or capable of making unprotected lefts only if oncoming traffic is traveling less than a threshold speed. In another example, one type of vehicle may be capable of traveling on controlled-access highways, while another type of vehicle may be capable of traveling only on roadways with a speed limit that is less than 45 miles per hour.

A routing graph modification based on the vehicle capability data 110 may include a graph element descriptor indicating graph components corresponding to roadway elements that are disfavored and/or not traversable by vehicles of a given type (e.g., includes an unprotected left, is part of a controlled-access highway, etc.) as well as a corresponding constraint indicating what is to be done to graph elements meeting the graph element descriptor. For example, graph elements corresponding to roadway elements that a particular vehicle type is not capable of traversing can be removed from the routing graph 116 or can have connectivity data modified to remove transitions to those graph elements. If the graph element descriptor indicates a graph elements including a maneuver that is undesirable for a vehicle, but not forbidden, then the constraint can call for increasing the cost of an identified graph element or transitions thereto.

The roadway condition data 112 describes routing graph modifications based, for example, on the state of one or more roadways. For example, if a roadway is to be closed for a parade or for construction, a routing graph modification can be used to remove the corresponding graph elements from the routing graph 116. In some examples, routing graph modifications based on roadway condition data 112 are operational. For example, such routing graph modifications may identity graph elements using unique identifiers of the graph elements.

The routing engine 108 generates the constrained routing grap 109 by applying routing graph modification data describing routing graph modifications. The described routing graph modifications may be based on the business policy data 114, roadway condition data 112, and/or vehicle capability data 110. The constrained routing graph 109 is used to generate a route for a vehicle 102, 120, 122, 124. The routing engine 108, in some examples, generates the constrained routing graph 109 at different times during route generation. In some examples, the routing engine 108 receives a request to generate a route for a particular vehicle 102, 120, 122, 124. The routing engine 108 responds by accessing the current routing graph modification data for the vehicle 102, 120, 122, 124. The routing engine 108 applies the routing graph modification data to the routing graph 116 to generate the constrained routing graph 109 and then uses the constrained routing graph 109 to generate a route.

In another example, the routing engine 108 generates the constrained routing graph 109 on an as-needed basis. For example, various path-planning algorithms described herein operate using graph expansion. To apply a graph expansion-type algorithm, the routing engine 108 begins at an algorithm start point and expands along allowable transitions to string together connected graph elements. The algorithm is complete when one or more of the strings of connected graph elements has an allowable transition to or from an algorithm end point. Many graph-expansion algorithms can be applied forwards (e.g., from a vehicle start point to a vehicle end point) or backwards (e.g., from a vehicle end point to a vehicle start point).

To generate the constrained routing graph 109 on an as-needed basis, the routing engine 108 can request a subset of the constrained routing graph 109 while graph expansion is being performed. For example, the routing engine 108 can determine a first portion of a route including a string of connected graph elements. The routing engine 108 can then request the constrained routing graph 109 data describing a set of graph elements that can be transitioned to the last graph element of the string (or a set of graph elements from which a vehicle can transition to the last graph element of the string if the algorithm is applied backwards). In this way, the routing engine 108 may not need to apply the routing graph modification data to all graph elements of the routing graph 116 but, instead, only to the graph elements used by the path-planning algorithm.

FIG. 2 is a diagram showing another example of an environment 200 for routing an autonomous vehicle. In the environment 200, a routing engine 208 is implemented by a vehicle autonomy system 201 of the vehicle 102 (e.g., onboard the vehicle 102). The routing engine 208 can operate in a manner similar to that of the routing engine 108 of FIG. 1. For example, the routing engine 208 can generate constrained routing graph 109 data from a general-purpose routing graph 116 and routing graph modification data that can be based on business policy data 114, roadway condition data 112, and/or vehicle capability data 110. In the example of FIG. 2, the routing graph modification data can be pre-loaded and/or transmitted to the vehicle 102.

Different types of autonomous vehicles will have differently arranged vehicle autonomy systems. In the example of FIG. 2, however, the routing engine 208 is implemented by a navigator system 202 of the vehicle autonomy system 201. The navigator system 202 provides one or more routes, generated as described herein, to a motion planner system 204. The motion planner system 204 generates commands that are provided to vehicle controls 206 to cause the vehicle to travel along the indicated route. Additional details of example navigator systems, motion planner systems, and vehicle controls are described herein with respect to FIG. 3.

FIG. 3 depicts a block diagram of an example vehicle 300 according to example aspects of the present disclosure. The vehicle 300 includes one or more sensors 301, a vehicle autonomy system 302, and one or more vehicle controls 307. The vehicle 300 is an autonomous vehicle, as described herein.

The vehicle autonomy system 302 includes a commander system 311, a navigator system 313, a perception system 303, a prediction system 304, a motion planning system 305, and a localizer system 330 that cooperate to perceive the surrounding environment of the vehicle 300 and determine a motion plan for controlling the motion of the vehicle 300 accordingly.

The vehicle autonomy system 302 is engaged to control the vehicle 300 or to assist in controlling the vehicle 300. In particular, the vehicle autonomy system 302 receives sensor data from the one or more sensors 301, attempts to comprehend the environment surrounding the vehicle 300 by performing various processing techniques on data collected by the sensors 301, and generates an appropriate route through the environment. The vehicle autonomy system 302 sends commands to control the one or more vehicle controls 307 to operate the vehicle 300 according to the route.

Various portions of the vehicle autonomy system 302 receive sensor data from the one or more sensors 301. For example, the sensors 301 may include remote-detection sensors as well as motion sensors such as an inertial measurement unit (IMU), one or more encoders, or one or more odometers. The sensor data includes information that describes the location of objects within the surrounding environment of the vehicle 300, information that describes the motion of the vehicle 300, etc.

The sensors 301 may also include one or more remote-detection sensors or sensor systems, such as a LIDAR system, a RADAR system, one or more cameras, etc. As one example, a LIDAR system of the one or more sensors 301 generates sensor data (e.g., remote-detection sensor data) that includes the location (e.g., in three-dimensional space relative to the LIDAR system) of a number of points that correspond to objects that have reflected a ranging laser. For example, the LIDAR system measures distances by measuring the Time of Flight (TOF) that it takes a short laser pulse to travel from the sensor to an object and back, calculating the distance from the known speed of light.

As another example, a RADAR system of the one or more sensors 301 generates sensor data (e.g., remote-detection sensor data) that includes the location (e.g., in three-dimensional space relative to the RADAR system) of a number of points that correspond to objects that have reflected ranging radio waves. For example, radio waves (e.g., pulsed or continuous) transmitted by the RADAR system reflect off an object and return to a receiver of the RADAR system, giving information about the object's location and speed. Thus, a RADAR system provides useful information about the current speed of an object.

As yet another example, one or more cameras of the one or more sensors 301 may generate sensor data (e.g., remote-detection sensor data) including still or moving images. Various processing techniques (e.g., range imaging techniques such as, for example, structure from motion, structured light, stereo triangulation, and/or other techniques) can be performed to identify the location (e.g., in three-dimensional space relative to the one or more cameras) of a number of points that correspond to objects that are depicted in an image or images captured by the one or more cameras. Other sensor systems can identify the location of points that correspond to objects as well.

As another example, the one or more sensors 301 can include a positioning system. The positioning system determines a current position of the vehicle 300. The positioning system can be any device or circuitry for analyzing the position of the vehicle 300. For example, the positioning system can determine a position by using one or more of inertial sensors, a satellite positioning system such as the Global Positioning System (GPS), a positioning system based on IP address, triangulation and/or proximity to network access points or other network components (e.g., cellular towers, Wi-Fi access points), and/or other suitable techniques. The position of the vehicle 300 can be used by various systems of the vehicle autonomy system 302.

Thus, the one or more sensors 301 are used to collect sensor data that includes information that describes the location (e.g., in three-dimensional space relative to the vehicle 300) of points that correspond to objects within the surrounding environment of the vehicle 300. In some implementations, the sensors 301 can be positioned at various different locations on the vehicle 300. As an example, in some implementations, one or more cameras and/or LIDAR sensors can be located in a pod or other structure that is mounted on a roof of the vehicle 300, while one or more RADAR sensors can be located in or behind the front and/or rear bumper(s) or body panel(s) of the vehicle 300. As another example, one or more cameras can be located at the front or rear bumper(s) of the vehicle 300. Other locations can be used as well.

The localizer system 330 receives some or all of the sensor data from the sensors 301 and generates vehicle poses for the vehicle 300. A vehicle pose describes a position and attitude of the vehicle 300. The vehicle pose (or portions thereof) can be used by various other components of the vehicle autonomy system 302 including, for example, the perception system 303, the prediction system 304, the motion planning system 305, and the navigator system 313.

The position of the vehicle 300 is a point in a three-dimensional space. In some examples, the position is described by values for a set of Cartesian coordinates, although any other suitable coordinate system may be used. The attitude of the vehicle 300 generally describes the way in which the vehicle 300 is oriented at its position. In some examples, attitude is described by a yaw about the vertical axis, a pitch about a first horizontal axis, and a roll about a second horizontal axis. In some examples, the localizer system 330 generates vehicle poses periodically (e.g., every second, every half second). The localizer system 330 appends time stamps to vehicle poses, where the time stamp for a pose indicates the point in time that is described by the pose. The localizer system 330 generates vehicle poses by comparing sensor data (e.g., remote-detection sensor data) to map data 326 describing the surrounding environment of the vehicle 300.

In some examples, the localizer system 330 includes one or more pose estimators and a pose filter. Pose estimators generate pose estimates by comparing remote-detection sensor data (e.g., LIDAR, RADAR) to map data. The pose filter receives pose estimates from the one or more pose estimators as well as other sensor data such as, for example, motion sensor data from an IMU, encoder, or odometer. In some examples, the pose filter executes a Kalman filter or machine learning algorithm to combine pose estimates from the one or more pose estimators with motion sensor data to generate vehicle poses. In some examples, pose estimators generate pose estimates at a frequency less than the frequency at which the localizer system 330 generates vehicle poses. Accordingly, the pose filter generates some vehicle poses by extrapolating from a previous pose estimate utilizing motion sensor data.

Vehicle poses and/or vehicle positions generated by the localizer system 330 are provided to various other components of the vehicle autonomy system 302. For example, the commander system 311 may utilize a vehicle position to determine whether to respond to a call from a dispatch system 340.

The commander system 311 determines a set of one or more target locations that are used for routing the vehicle 300. The target locations are determined based on user input received via a user interface 309 of the vehicle 300. The user interface 309 may include and/or use any suitable input/output device or devices. In some examples, the commander system 311 determines the one or more target locations considering data received from the dispatch system 340. The dispatch system 340 is programmed to provide instructions to multiple vehicles, for example, as part of a fleet of vehicles for moving passengers and/or cargo. Data from the dispatch system 340 can be provided via a wireless network, for example.

The navigator system 313 receives one or more target locations from the commander system 311 and map data 326. The map data 326, for example, provides detailed information about the surrounding environment of the vehicle 300. The map data 326 provides information regarding identity and location of different roadways and segments of roadways (e.g., lane segments or graph elements). A roadway is a place where the vehicle 300 can drive and may include, for example, a road, a street, a highway, a lane, a parking lot, or a driveway. Routing graph data is a type of map data 326.

From the one or more target locations and the map data 326, the navigator system 313 generates route data describing a route for the vehicle 300 to take to arrive at the one or more target locations. In some implementations, the navigator system 313 determines route data using one or more path-planning algorithms based on costs for graph elements, as described herein. For example, a cost for a route can indicate a time of travel, risk of danger, or other factor associated with adhering to a particular candidate route. Route data describing a route is provided to the motion planning system 305, which commands the vehicle controls 307 to implement the route or route extension, as described herein. The navigator system 313 can generate routes as described herein using a general-purpose routing graph and routing graph modification data. Also, in examples where route data is received from the dispatch system 340, that route data can also be provided to the motion planning system 305.

The perception system 303 detects objects in the surrounding environment of the vehicle 300 based on sensor 301 data, the map data 326, and/or vehicle poses provided by the localizer system 330. For example, the map data 326 used by the perception system 303 describes roadways and segments thereof and may also describe buildings or other items or objects (e.g., lampposts, crosswalks, curbing); location and directions of traffic lanes or lane segments (e.g., the location and direction of a parking lane, a turning lane, a bicycle lane, or other lanes within a particular roadway); traffic control data (e.g., the location and instructions of signage, traffic lights, or other traffic control devices); and/or any other map data that provides information that assists the vehicle autonomy system 302 in comprehending and perceiving its surrounding environment and its relationship thereto.

In some examples, the perception system 303 determines state data for one or more of the objects in the surrounding environment of the vehicle 300. State data describes a current state of an object (also referred to as features of the object). The state data for each object describes, for example, an estimate of the object's current location (also referred to as position); current speed (also referred to as velocity); current acceleration; current heading; current orientation; size/shape/footprint (e.g., as represented by a bounding shape such as a bounding polygon or polyhedron); type/class (e.g., vehicle, pedestrian, bicycle, or other); yaw rate; distance from the vehicle 300; minimum path to interaction with the vehicle 300; minimum time duration to interaction with the vehicle 300; and/or other state information.

In some implementations, the perception system 303 determines state data for each object over a number of iterations. In particular, the perception system 303 updates the state data for each object at each iteration. Thus, the perception system 303 detects and tracks objects, such as other vehicles, that are proximate to the vehicle 300 over time.

The prediction system 304 is configured to predict one or more future positions for an object or objects in the environment surrounding the vehicle 300 (e.g., an object or objects detected by the perception system 303). The prediction system 304 generates prediction data associated with one or more of the objects detected by the perception system 303. In some examples, the prediction system 304 generates prediction data describing each of the respective objects detected by the perception system 304.

Prediction data for an object is indicative of one or more predicted future locations of the object. For example, the prediction system 304 may predict where the object will be located within the next 5 seconds, 20 seconds, 300 seconds, etc. Prediction data for an object may indicate a predicted trajectory (e.g., predicted path) for the object within the surrounding environment of the vehicle 300. For example, the predicted trajectory (e.g., path) can indicate a path along which the respective object is predicted to travel over time (and/or the speed at which the object is predicted to travel along the predicted path). The prediction system 304 generates prediction data for an object, for example, based on state data generated by the perception system 303. In some examples, the prediction system 304 also considers one or more vehicle poses generated by the localizer system 330 and/or map data 326.

In some examples, the prediction system 304 uses state data indicative of an object type or classification to predict a trajectory for the object. As an example, the prediction system 304 can use state data provided by the perception system 303 to determine that a particular object (e.g., an object classified as a vehicle) approaching an intersection and maneuvering into a left-turn lane intends to turn left. In such a situation, the prediction system 304 predicts a trajectory (e.g., path) corresponding to a left-turn for the vehicle such that the vehicle turns left at the intersection. Similarly, the prediction system 304 determines predicted trajectories for other objects, such as bicycles, pedestrians, parked vehicles, etc. The prediction system 304 provides the predicted trajectories associated with the object(s) to the motion planning system 305.

In some implementations, the prediction system 304 is a goal-oriented prediction system 304 that generates one or more potential goals, selects one or more of the most likely potential goals, and develops one or more trajectories by which the object can achieve the one or more selected goals. For example, the prediction system 304 can include a scenario generation system that generates and/or scores the one or more goals for an object, and a scenario development system that determines the one or more trajectories by which the object can achieve the goals. In some implementations, the prediction system 304 can include a machine-learned goal-scoring model, a machine-learned trajectory development model, and/or other machine-learned models.

The motion planning system 305 commands the vehicle controls 307 based at least in part on the predicted trajectories associated with the objects within the surrounding environment of the vehicle 300, the state data for the objects provided by the perception system 303, vehicle poses provided by the localizer system 330, the map data 326, and route or route extension data provided by the navigator system 313. Stated differently, given information about the current locations of objects and/or predicted trajectories of objects within the surrounding environment of the vehicle 300, the motion planning system 305 determines control commands for the vehicle 300 that best navigate the vehicle 300 along the route or route extension relative to the objects at such locations and their predicted trajectories on acceptable roadways.

In some implementations, the motion planning system 305 can also evaluate one or more cost functions and/or one or more reward functions for each of one or more candidate control commands or sets of control commands for the vehicle 300. Thus, given information about the current locations and/or predicted future locations/trajectories of objects, the motion planning system 305 can determine a total cost (e.g., a sum of the cost(s) and/or reward(s) provided by the cost function(s) and/or reward function(s)) of adhering to a particular candidate control command or set of control commands. The motion planning system 305 can select or determine a control command or set of control commands for the vehicle 300 based at least in part on the cost function(s) and the reward function(s). For example, the motion plan that minimizes the total cost can be selected or otherwise determined.

In some implementations, the motion planning system 305 can be configured to iteratively update the route or route extension for the vehicle 300 as new sensor data is obtained from the one or more sensors 301. For example, as new sensor data is obtained from the one or more sensors 301, the sensor data can be analyzed by the perception system 303, the prediction system 304, and the motion planning system 305 to determine the motion plan.

The motion planning system 305 can provide control commands to the one or more vehicle controls 307. For example, the one or more vehicle controls 307 can include throttle systems, brake systems, steering systems, and other control systems, each of which can include various vehicle controls (e.g., actuators or other devices that control gas flow, steering, and braking) to control the motion of the vehicle 300. The various vehicle controls 307 can include one or more controllers, control devices, motors, and/or processors.

The vehicle controls 307 can include a brake control module 320. The brake control module 320 is configured to receive a braking command and bring about a response by applying (or not applying) the vehicle brakes. In some examples, the brake control module 320 includes a primary system and a secondary system. The primary system receives braking commands and, in response, brakes the vehicle 300. The secondary system may be configured to determine a failure of the primary system to brake the vehicle 300 in response to receiving the braking command.

A steering control system 332 is configured to receive a steering command and bring about a response in the steering mechanism of the vehicle 300. The steering command is provided to a steering system to provide a steering input to steer the vehicle 300.

A lighting/auxiliary control module 336 receives a lighting or auxiliary command. In response, the lighting/auxiliary control module 336 controls a lighting and/or auxiliary system of the vehicle 300. Controlling a lighting system may include, for example, turning on, turning off, or otherwise modulating headlights, parking lights, running lights, etc. Controlling an auxiliary system may include, for example, modulating windshield wipers, a defroster, etc.

A throttle control system 334 is configured to receive a throttle command and bring about a response in the engine speed or other throttle mechanism of the vehicle. For example, the throttle control system 334 can instruct an engine and/or engine controller, or other propulsion system component, to control the engine or other propulsion system of the vehicle 300 to accelerate, decelerate, or remain at its current speed.

Each of the perception system 303, the prediction system 304, the motion planning system 305, the commander system 311, the navigator system 313, and the localizer system 330 can be included in or otherwise be a part of the vehicle autonomy system 302 configured to control the vehicle 300 based at least in part on data obtained from the one or more sensors 301. For example, data obtained by the one or more sensors 301 can be analyzed by each of the perception system 303, the prediction system 304, and the motion planning system 305 in a consecutive fashion in order to control the vehicle 300. While FIG. 3 depicts elements suitable for use in a vehicle autonomy system according to example aspects of the present disclosure, one of ordinary skill in the art will recognize that other vehicle autonomy systems can be configured to control an autonomous vehicle based on sensor data.

The vehicle autonomy system 302 includes one or more computing devices, which may implement all or parts of the perception system 303, the prediction system 304, the motion planning system 305, and/or the localizer system 330. Descriptions of hardware and software configurations for computing devices to implement the vehicle autonomy system 302 and/or the dispatch system 340 are provided herein with reference to FIGS. 10 and 11.

FIG. 4 is a flowchart showing one example of a process flow 400 that can be executed by a routing engine to generate a route for an autonomous vehicle using routing graph modification data and a routing graph to generate a constrained routing graph. The process flow 400 can be executed by routing engines in a variety of contexts. In some examples, the process flow 400 is executed by a routing engine that is implemented and/or used in conjunction with a navigator system or other remote system, such as the routing engine 108. In other examples, the process flow 400 is executed by a routing engine that is implemented onboard a vehicle, such as the routing engine 208.

At operation 402, the routing engine accesses routing graph modification data. Routing graph modification data describes one or more routing graph modifications and can be based on, for example, vehicle capability data 110, roadway condition data 112, and/or business policy data 114, as described herein. Routing graph modification data can be accessed in any suitable manner. In examples where the routing engine is implemented onboard a vehicle, routing graph modification data is stored locally at the vehicle and/or received from a remote source. In examples where the routing engine is implemented at a dispatch system, such as the dispatch system 104, the routing graph modification data can be stored at the dispatch system and/or received from a remote source. At operation 404, the routing engine accesses routing graph data, such as from the routing graph 116. The accessed routing graph data can include some or all of the routing graph.

At operation 406, the routing engine generates constrained routing graph data. This includes applying the routing graph modification data accessed at operation 402 to the routing graph data accessed at operation 404. Consider an example routing graph modification that includes a graph element descriptor and a corresponding constraint. The routing engine applies the routing graph modification by identifying graph elements from the routing graph (or considered portion thereof) that meet the graph element descriptor. The routing engine then generates constrained routing graph data, at least in part, by applying the constraint to the identified graph elements. The constrained routing graph data generated at operation 406 can include some or all of the routing graph data accessed at operation 404. In some examples, as described herein, the routing engine can generate a constrained routing graph for a sub-set or portion of the routing graph.

At operation 408, the routing engine generates a route using the constrained routing graph data generated at operation 406. The generated route may include the lowest-cost set of connected graph elements from a vehicle start point to a vehicle end point. Any suitable path-planning algorithm can be used, for example, as described herein. The routing engine can cause an autonomous vehicle to execute the generated route. For example, when the routing engine is implemented in a dispatch system, such as the dispatch system 104 of FIG. 1, the routing engine (e.g., via the dispatch system) can transmit the route to an autonomous vehicle, which begins to control the vehicle along the route. In examples in which the routing engine is implemented onboard a vehicle, such as the routing engine 208 of FIG. 2, the routing engine can provide the generated route to the vehicle autonomy system, which may begin to control the vehicle along the route.

FIG. 5 is a flowchart showing one example of a process flow 500 that can be executed by a routing engine to generate a constrained routing graph using routing graph modification data. For example, the process flow 500 is one example way that the routing engine can perform operation 406 of the process flow 400 (FIG. 4). The process flow 500 shows an example that operates on a set of graph elements that can be all or a portion of a routing graph. For example, the process flow 500 can be executed on all of the graph elements of a routing graph. In some examples, the process flow 500 is executed on a set of graph elements that are less than all of a routing graph.

At operation 502, the routing engine considers a first graph element selected from routing graph data accessed as described herein. At operation 504, the routing engine considers a first routing graph modification selected from routing graph modification data with respect to the considered graph element, accessed as described herein.

At operation 506, the routing engine determines if the considered graph element meets the graph element descriptor of the considered routing graph modification. If the graph element meets the graph element descriptor of the routing graph modification, then the routing engine applies the constraint to the graph element at operation 508. Applying the constraint can include, for example, modifying a cost associated with the graph element, modifying a connectivity of the graph element to other graph elements, etc.

If the considered graph element does not meet the graph element descriptor, or after applying the constraint at operation 508, the routing engine determines at operation 510 if there are additional routing graph modifications to be considered. If there are additional routing graph modifications to be considered, the routing engine selects the next routing graph modification at operation 512 and returns to operation 504 to consider the next routing graph modification. If there are no additional routing graph modifications to be considered, the routing engine determines, at operation 514, if there are additional graph elements to be considered. If there are additional graph elements to be considered, the routing engine moves to the next graph element at operation 516 and considers the next graph element beginning at operation 502 as described herein. If there are not more graph elements to process, the process flow 500 concludes at operation 518. It will be appreciated that the process flow 500 shows just one example way that the routing engine can generate a routing graph.

FIG. 6 is a flowchart showing one example of a process flow 600 that can be executed by a routing engine to generate a route using a routing graph and a pre-generated constrained routing graph. For example, the constrained routing graph can be generated from a general routing graph prior to execution of the process flow 600.

At operation 602, the routing engine accesses a portion of constrained routing graph data. The constrained routing graph data may have been generated, for example, as described herein with respect to FIGS. 4 and 5. For example, the portion of the constrained routing graph data can include a subset of the graph elements of a full constrained routing graph. Accessing the portion of the constrained routing graph data can include retrieving the portion of the constrained routing graph data from a local or remote storage device. The portion of the constrained routing graph data, in some examples, is selected based on a transportation service to be routed and/or a location of a vehicle to be routed. For example, the portion of the constrained routing graph data can include an area of the constrained routing graph at or around a current location of a vehicle to be routed, a portion of the constrained routing graph at or around a vehicle start point for the route, a portion of the constrained routing graph at or around a vehicle end point for the route, etc.

At operation 604, the routing engine generates a route portion based on the portion of the constrained routing graph data accessed at operation 602. In some examples, this includes generating a lowest-cost route using the portion of the constrained routing graph data. The route portion can terminate at a route portion endpoint graph element. At operation 606, the routing engine determines if the route is complete (e.g., if the route portion endpoint is also the route endpoint). If the route is complete, the process flow 600 may complete at operation 608.

If the route is not complete at operation 606, the routing engine may return to operation 602 and access a next portion of the constrained routing graph data. In some examples, the next portion of the constrained routing graph data is selected based on the previously generated route portion. The next portion of the constrained routing graph data may correspond to a next portion of the route to be determined. For example, the next portion of the constrained routing graph data may include at least one graph element of the constrained routing graph data that has a connection to the previous route portion endpoint graph element. Also, for example, the next route portion generated at operation 604 can begin from the route portion endpoint graph element of the previous route portion.

FIG. 7 is a flowchart showing one example of a process flow 700 that can be executed by a routing engine to generate a route using a routing graph and routing graph modification data, where a constrained routing graph is made while the route is being generated. For example, the process flow 700 can be executed when the routing engine generates constrained routing graph data between steps of a graph expansion.

At operation 702, the routing engine generates a portion of a constrained routing graph. The portion of the constrained routing graph can be generated, for example, as described herein with respect to FIGS. 4 and 5. For example, the portion of the constrained routing graph can be generated by applying routing graph modification data to a portion of the graph elements making up a routing graph. The portion of the constrained routing graph, in some examples, is selected based on a transportation service to be routed and/or a location of a vehicle to be routed. For example, the portion of the constrained routing graph can include an area of the constrained routing graph at or around a current location of a vehicle to be routed, a portion of the constrained routing graph at or around a vehicle start point for the route, a portion of the constrained routing graph at or around a vehicle end point for the route, etc.

At operation 704, the routing engine generates a portion of a route using the portion of the constrained routing graph generated at operation 702. This can include, for example, generating a route from a start-point graph element to an end-point graph element. In some examples, the operation 704 comprises generating a portion of a graph expansion based on all or some of the constrained routing graph. At operation 706, the routing engine determines whether the route is complete. If the route is complete, the process flow 700 may end at operation 708. If the route is not complete, the routing engine may generate a next portion of the constrained routing graph at operation 702. The next portion of the constrained routing graph may correspond to a next portion of the route to be determined. In some examples, the next portion of the constrained routing graph can be a portion contiguous to the previous portion.

FIG. 8 is a flowchart showing one example of a process flow 800 that can be executed by a routing engine to update constrained routing graph data upon receipt of new routing graph modification data. New routing graph modification data can be received in response to an update or change to existing routing graph modification data. For example, vehicle capability data can be updated. Business policy data may also be updated. Roadway conditions may change and corresponding roadway condition data can be updated.

At operation 802, the routing engine determines whether new routing graph modification data has been received. If new routing graph modification data has been received, the routing engine generates updated constrained routing graph data at operation 804, for example, as described herein with respect to FIGS. 4 and 5. Updated constrained routing graph data can describe all or a portion of any previously generated constrained routing graph data. At operation 806, the updated constrained routing graph data is applied to generate all or part of a route, for example, as described herein.

FIG. 9 is a flowchart showing one example of a process flow 900 that can be executed by a dispatch system or similar system to generate a route for an autonomous vehicle using routing graph modification data that varies by autonomous vehicle type. At operation 902, the dispatch system (e.g., a routing engine thereof) receives a route request. The route request describes a route to be determined. The route request may include indications of a vehicle start point and a vehicle end point. In some examples, more than one permissible vehicle start point and/or vehicle end point are indicated.

At operation 904, the routing engine determines a type of the vehicle to be routed. At operation 906, the routing engine accesses routing graph modification data associated with the determined type of vehicle. For example, different types of autonomous vehicles have different vehicle capability data. Also, in some examples, different types of autonomous vehicles can have different associated business policies and/or have different constraints associated with various roadway conditions. At operation 908, the routing engine accesses routing graph data. At operation 910, the routing engine generates constrained routing graph data using the accessed vehicle-type routing graph modification data and the accessed routing graph data. At operation 912, the routing engine generates a route using the constrained routing graph data.

EXAMPLES

Example 1 is a method for routing autonomous vehicles, the method comprising: accessing first routing graph modification data comprising a first graph element descriptor and a first constraint, the first routing graph modification data based at least in part on first vehicle capability data describing a first type of autonomous vehicle; accessing second routing graph modification data comprising a second graph element descriptor and a second constraint, the second routing graph modification data based at least in part on second vehicle capability data describing a second type of autonomous vehicle; accessing routing graph data describing a plurality of graph elements, the routing graph data comprising: a first graph element cost describing a first graph element of the plurality of graph elements and connectivity data describing at least one connection between the first graph element and a second graph element of the plurality of graph elements; generating a first route for a first autonomous vehicle of the first type, the generating of the first route based at least in part on the first routing graph modification data and the routing graph data; generating a second route for a second autonomous vehicle of the second type, the generating of the second route based at least in part on the second routing graph modification data and the routing graph data; and causing at least the first autonomous vehicle to begin traveling the first route.

In Example 2, the subject matter of Example 1 optionally includes wherein the generating the first route comprising generating first constrained routing graph data based at least in part on the first routing graph modification data and the routing graph data.

In Example 3, the subject matter of Example 2 optionally includes generating a first portion of the first constrained routing graph data; determining a first portion of the first route based at least in part on the first portion of the first constrained routing graph data, the first portion of the first route including a first portion endpoint; and after determining the first portion of the first route, generating a second portion of the first constrained routing graph data, the second portion of the first constrained routing graph data describing at least one graph element of the plurality of graph elements having a connection to the first portion endpoint.

In Example 4, the subject matter of any one or more of Examples 2-3 optionally includes wherein determining the first route comprises: after generating the first constrained routing graph data, determining a first portion of the first route, the first portion of the first route including a first portion end point; accessing a portion of the first constrained routing graph data that describes at least one graph element of the plurality of graph elements having a connection to the first portion end point; and determining a second portion of the first route based at least in part on the portion of the first constrained routing graph data.

In Example 5, the subject matter of any one or more of Examples 1-4 optionally includes accessing roadway condition data describing a condition of at least one roadway element described by the routing graph data, wherein the first routing graph modification data is based at least in part on the roadway condition data.

In Example 6, the subject matter of any one or more of Examples 1-5 optionally includes accessing business policy data describing a business policy applicable at least to autonomous vehicles of the first type, wherein the first routing graph modification data is based at least in part on the business policy data.

In Example 7, the subject matter of any one or more of Examples 1-6 optionally includes wherein generating the first route comprises: determining that the first graph element meets the first graph element descriptor; and applying the first constraint to the first graph element.

In Example 8, the subject matter of Example 7 optionally includes wherein applying the first constraint to the first graph element comprises increasing the first cost.

In Example 9, the subject matter of any one or more of Examples 7-8 optionally includes wherein applying the first constraint to the first graph element comprises disabling the at least one connection between the first graph element and the second graph element.

In Example 10, the subject matter of any one or more of Examples 7-9 optionally includes wherein applying the first constraint to the first graph element comprises storing an indication that a roadway element corresponding to the first graph element is to be traversed in a manual mode or a semi-autonomous mode.

In Example 11, the subject matter of any one or more of Examples 1-10 optionally includes wherein causing the first autonomous vehicle to begin traveling the first route comprises: transmitting first route data describing the first route to the first autonomous vehicle; and transmitting to the first autonomous vehicle an instruction to begin traveling the first route.

In Example 12, the subject matter of any one or more of Examples 1-11 optionally includes wherein causing the autonomous vehicle to begin traveling the first route comprises modifying at least one vehicle control of the autonomous vehicle.

In Example 13, the subject matter of any one or more of Examples 1-12 optionally includes selecting the first autonomous vehicle to execute a transportation service based at least in part on the first route and the second route.

Example 14 is a system for routing autonomous vehicles, the system comprising: at least one processor unit programmed to perform operations comprising: accessing first routing graph modification data comprising a first graph element descriptor and a first constraint, the first routing graph modification data based at least in part on first vehicle capability data describing a first type of autonomous vehicle; accessing second routing graph modification data comprising a second graph element descriptor and a second constraint, the second routing graph modification data based at least in part on second vehicle capability data describing a second type of autonomous vehicle; accessing routing graph data describing a plurality of graph elements, the routing graph data comprising: a first graph element cost describing a first graph element of the plurality of graph elements and connectivity data describing at least one connection between the first graph element and a second graph element of the plurality of graph elements; generating a first route for a first autonomous vehicle of the first type, the generating of the first route based at least in part on the first routing graph modification data and the routing graph data; generating a second route for a second autonomous vehicle of the second type, the generating of the second route based at least in part on the second routing graph modification data and the routing graph data; and causing at least the first autonomous vehicle to begin traveling the first route.

In Example 15, the subject matter of Example 14 optionally includes wherein the generating the first route comprising generating first constrained routing graph data based at least in part on the first routing graph modification data and the routing graph data.

In Example 16, the subject matter of Example 15 optionally includes the operations further comprising: generating a first portion of the first constrained routing graph data; determining a first portion of the first route based at least in part on the first portion of the first constrained routing graph data, the first portion of the first route including a first portion endpoint; and after determining the first portion of the first route, generating a second portion of the first constrained routing graph data, the second portion of the first constrained routing graph data describing at least one graph element of the plurality of graph elements having a connection to the first portion endpoint.

In Example 17, the subject matter of any one or more of Examples 15-16 optionally includes wherein determining the first route comprises: after generating the first constrained routing graph data, determining a first portion of the first route, the first portion of the first route including a first portion end point; accessing a portion of the first constrained routing graph data that describes at least one graph element of the plurality of graph elements having a connection to the first portion end point; and determining a second portion of the first route based at least in part on the portion of the first constrained routing graph data.

In Example 18, the subject matter of any one or more of Examples 14-17 optionally includes the operations further comprising accessing roadway condition data describing a condition of at least one roadway element described by the routing graph data, wherein the first routing graph modification data is based at least in part on the roadway condition data.

In Example 19, the subject matter of any one or more of Examples 14-18 optionally includes the operations further comprising accessing business policy data describing a business policy applicable at least to autonomous vehicles of the first type, wherein the first routing graph modification data is based at least in part on the business policy data.

Example 20 is a non-transitory machine-readable medium comprising instructions stored thereon that, when executed by at least one processor unit, cause the at least one processor unit to perform operations comprising: accessing first routing graph modification data comprising a first graph element descriptor and a first constraint, the first routing graph modification data based at least in part on first vehicle capability data describing a first type of autonomous vehicle; accessing second routing graph modification data comprising a second graph element descriptor and a second constraint, the second routing graph modification data based at least in part on second vehicle capability data describing a second type of autonomous vehicle; accessing routing graph data describing a plurality of graph elements, the routing graph data comprising: a first graph element cost describing a first graph element of the plurality of graph elements and connectivity data describing at least one connection between the first graph element and a second graph element of the plurality of graph elements; generating a first route for a first autonomous vehicle of the first type, the generating of the first route based at least in part on the first routing graph modification data and the routing graph data; generating a second route for a second autonomous vehicle of the second type, the generating of the second route based at least in part on the second routing graph modification data and the routing graph data; and causing at least the first autonomous vehicle to begin traveling the first route.

Example 21 is a method for routing an first autonomous vehicle, the method comprising: accessing routing graph modification data describing a first graph element descriptor and a first constraint associated with the first graph element descriptor; accessing routing graph data describing a plurality of graph elements, the routing graph data comprising: connectivity data describing at least one connection to a first graph element from a second graph element of the plurality of graph elements; a first graph element cost associated with the first graph element; a first predicate graph element property describing the first graph element; generating constrained routing graph data based at least in part on the routing graph modification data, the generating comprising: determining that the first graph element descriptor indicates the predicate graph element property; and applying the first constraint to the first graph element; determining a first route for the first autonomous vehicle based at least in part on the constrained routing graph data; and causing the first autonomous vehicle to begin traveling the first route.

In Example 22, the subject matter of Example 21 optionally includes wherein applying the first constraint to the routing graph data comprises increasing the first graph element cost.

In Example 23, the subject matter of any one or more of Examples 21-22 optionally includes wherein applying the first constraint to the routing graph data comprises disabling the at least one connection to the first graph element from a second graph element of the plurality of graph elements.

In Example 24, the subject matter of Example 23 optionally includes wherein applying the first constraint comprises storing an indication that the first graph element is to be traversed in a manual mode or a semi-autonomous mode.

In Example 25, the subject matter of any one or more of Examples 21-24 optionally includes wherein the first graph element descriptor is based at least in part on vehicle capability data describing a first type of autonomous vehicle, wherein the first autonomous vehicle is of the first type of autonomous vehicle.

In Example 26, the subject matter of any one or more of Examples 21-25 optionally includes wherein the first graph element descriptor comprises a unique identifier of the first graph element.

In Example 27, the subject matter of any one or more of Examples 21-26 optionally includes wherein the routing graph modification data is based at least on part on a condition of at least one roadway described by the routing graph data.

In Example 28, the subject matter of any one or more of Examples 21-27 optionally includes wherein the routing graph modification data is based at least in part on a business policy applicable to a plurality of autonomous vehicles including the first autonomous vehicle.

In Example 29, the subject matter of any one or more of Examples 21-28 optionally includes generating a first portion of the constrained routing graph data; determining a first portion of the first route based at least in part on the first portion of the constrained routing graph data, the first portion of the first route including a first portion endpoint; and after determining the first portion of the first route, generating a second portion of the constrained routing graph data, the second portion of the constrained routing graph data describing at least one graph element of the plurality of graph elements having a connection to the first portion endpoint.

In Example 30, the subject matter of any one or more of Examples 21-29 optionally includes wherein determining the first route comprises: after generating the constrained routing graph data, determining a first portion of the first route, the first portion of the first route including a first portion end point; accessing a portion of the constrained routing graph data that describes at least one graph element of the plurality of graph elements having a connection to the first portion endpoint; and determining a second portion of the first route based at least in part on the portion of the constrained routing graph data.

In Example 31, the subject matter of any one or more of Examples 21-30 optionally includes wherein causing the first autonomous vehicle to begin traveling the first route comprises: transmitting route data describing the first route to the first autonomous vehicle; and transmitting to the first autonomous vehicle an instruction to begin traveling the first route.

In Example 32, the subject matter of any one or more of Examples 21-31 optionally includes wherein causing the first autonomous vehicle to begin traveling the first route comprises modifying at least one vehicle control of the first autonomous vehicle.

In Example 33, the subject matter of any one or more of Examples 21-32 optionally includes determining a second route for a second autonomous vehicle based at least in part on the routing graph data, wherein the first route and the second route are for executing a first transportation service; and determining to offer the transportation service to the first autonomous vehicle based at least in part on the first route and the second route.

In Example 34, the subject matter of any one or more of Examples 21-33 optionally includes determining that the first autonomous vehicle is of a first autonomous vehicle type, wherein the routing graph modification data is associated with the first autonomous vehicle type; determining that a second autonomous vehicle is of a second autonomous vehicle type; accessing second routing graph modification data associated with the second autonomous vehicle type; generating second constrained routing graph data based at least in part on the second routing graph modification data and the routing graph data; and determining a second route for the second autonomous vehicle based at least in part on the second constrained routing graph data.

FIG. 10 is a block diagram 1000 showing one example of a software architecture 1002 for a computing device. The software architecture 1002 may be used in conjunction with various hardware architectures, for example, as described herein. FIG. 10 is merely a non-limiting example of a software architecture 1002, and many other architectures may be implemented to facilitate the functionality described herein. A representative hardware layer 1004 is illustrated and can represent, for example, any of the above-referenced computing devices. In some examples, the hardware layer 1004 may be implemented according to an architecture 1100 of FIG. 11 and/or the software architecture 1002 of FIG. 10.

The representative hardware layer 1004 comprises one or more processing units 1006 having associated executable instructions 1008. The executable instructions 1008 represent the executable instructions of the software architecture 1002, including implementation of the methods, modules, components, and so forth of FIGS. 1-9. The hardware layer 1004 also includes memory and/or storage modules 1010, which also have the executable instructions 1008. The hardware layer 1004 may also comprise other hardware 1012, which represents any other hardware of the hardware layer 1004, such as the other hardware illustrated as part of the architecture 1100.

In the example architecture of FIG. 10, the software architecture 1002 may be conceptualized as a stack of layers where each layer provides particular functionality. For example, the software architecture 1002 may include layers such as an operating system 1014, libraries 1016, frameworks/middleware 1018, applications 1020, and a presentation layer 1044. Operationally, the applications 1020 and/or other components within the layers may invoke application programming interface (API) calls 1024 through the software stack and receive a response, returned values, and so forth illustrated as messages 1026 in response to the API calls 1024. The layers illustrated are representative in nature, and not all software architectures have all layers. For example, some mobile or special-purpose operating systems may not provide a frameworks/middleware 1018 layer, while others may provide such a layer. Other software architectures may include additional or different layers.

The operating system 1014 may manage hardware resources and provide common services. The operating system 1014 may include, for example, a kernel 1028, services 1030, and drivers 1032. The kernel 1028 may act as an abstraction layer between the hardware and the other software layers. For example, the kernel 1028 may be responsible for memory management, processor management (e.g., scheduling), component management, networking, security settings, and so on. The services 1030 may provide other common services for the other software layers. In some examples, the services 1030 include an interrupt service. The interrupt service may detect the receipt of a hardware or software interrupt and, in response, cause the software architecture 1002 to pause its current processing and execute an interrupt service routine (ISR) when an interrupt is received. The ISR may generate an alert.

The drivers 1032 may be responsible for controlling or interfacing with the underlying hardware. For instance, the drivers 1032 may include display drivers, camera drivers, Bluetooth® drivers, flash memory drivers, serial communication drivers (e.g., Universal Serial Bus (USB) drivers), WiFi® drivers, near-field communication (NFC) drivers, audio drivers, power management drivers, and so forth depending on the hardware configuration.

The libraries 1016 may provide a common infrastructure that may be used by the applications 1020 and/or other components and/or layers. The libraries 1016 typically provide functionality that allows other software modules to perform tasks in an easier fashion than by interfacing directly with the underlying operating system 1014 functionality (e.g., kernel 1028, services 1030, and/or drivers 1032). The libraries 1016 may include system libraries 1034 (e.g., C standard library) that may provide functions such as memory allocation functions, string manipulation functions, mathematic functions, and the like. In addition, the libraries 1016 may include API libraries 1036 such as media libraries (e.g., libraries to support presentation and manipulation of various media formats such as MPEG4, H.264, MP3, AAC, AMR, JPG, and PNG), graphics libraries (e.g., an OpenGL framework that may be used to render 2D and 3D graphic content on a display), database libraries (e.g., SQLite that may provide various relational database functions), web libraries (e.g., WebKit that may provide web browsing functionality), and the like. The libraries 1016 may also include a wide variety of other libraries 1038 to provide many other APIs to the applications 1020 and other software components/modules.

The frameworks 1018 (also sometimes referred to as middleware) may provide a higher-level common infrastructure that may be used by the applications 1020 and/or other software components/modules. For example, the frameworks 1018 may provide various graphical user interface (GUI) functions, high-level resource management, high-level location services, and so forth. The frameworks 1018 may provide a broad spectrum of other APIs that may be used by the applications 1020 and/or other software components/modules, some of which may be specific to a particular operating system or platform.

The applications 1020 include built-in applications 1040 and/or third-party applications 1042. Examples of representative built-in applications 1040 may include, but are not limited to, a contacts application, a browser application, a book reader application, a location application, a media application, a messaging application, and/or a game application. The third-party applications 1042 may include any of the built-in applications 1040 as well as a broad assortment of other applications. In a specific example, the third-party application 1042 (e.g., an application developed using the Android™ or iOS™ software development kit (SDK) by an entity other than the vendor of the particular platform) may be mobile software running on a mobile operating system such as iOS™, Android™, Windows® Phone, or other computing device operating systems. In this example, the third-party application 1042 may invoke the API calls 1024 provided by the mobile operating system such as the operating system 1014 to facilitate functionality described herein.

The applications 1020 may use built-in operating system functions (e.g., kernel 1028, services 1030, and/or drivers 1032), libraries (e.g., system libraries 1034, API libraries 1036, and other libraries 1038), or frameworks/middleware 1018 to create user interfaces to interact with users of the system. Alternatively, or additionally, in some systems, interactions with a user may occur through a presentation layer, such as the presentation layer 1044. In these systems, the application/module “logic” can be separated from the aspects of the application/module that interact with a user.

Some software architectures use virtual machines. For example, systems described herein may be executed using one or more virtual machines executed at one or more server computing machines. In the example of FIG. 10, this is illustrated by a virtual machine 1048. A virtual machine creates a software environment where applications/modules can execute as if they were executing on a hardware computing device. The virtual machine 1048 is hosted by a host operating system (e.g., the operating system 1014) and typically, although not always, has a virtual machine monitor 1046, which manages the operation of the virtual machine 1048 as well as the interface with the host operating system (e.g., the operating system 1014). A software architecture executes within the virtual machine 1048, such as an operating system 1050, libraries 1052, frameworks/middleware 1054, applications 1056, and/or a presentation layer 1058. These layers of software architecture executing within the virtual machine 1048 can be the same as corresponding layers previously described or may be different.

FIG. 11 is a block diagram illustrating a computing device hardware architecture 1100, within which a set or sequence of instructions can be executed to cause a machine to perform examples of any one of the methodologies discussed herein. The hardware architecture 1100 describes a computing device for executing the vehicle autonomy system, described herein.

The architecture 1100 may operate as a standalone device or may be connected (e.g., networked) to other machines. In a networked deployment, the architecture 1100 may operate in the capacity of either a server or a client machine in server-client network environments, or it may act as a peer machine in peer-to-peer (or distributed) network environments. The architecture 1100 can be implemented in a personal computer (PC), a tablet PC, a hybrid tablet, a set-top box (STB), a personal digital assistant (PDA), a mobile telephone, a web appliance, a network router, a network switch, a network bridge, or any machine capable of executing instructions (sequential or otherwise) that specify operations to be taken by that machine.

The example architecture 1100 includes a processor unit 1102 comprising at least one processor (e.g., a central processing unit (CPU), a graphics processing unit (GPU), or both, processor cores, compute nodes). The architecture 1100 may further comprise a main memory 1104 and a static memory 1106, which communicate with each other via a link 1108 (e.g., a bus). The architecture 1100 can further include a video display unit 1110, an input device 1112 (e.g., a keyboard), and a UI navigation device 1114 (e.g., a mouse). In some examples, the video display unit 1110, input device 1112, and UI navigation device 1114 are incorporated into a touchscreen display. The architecture 1100 may additionally include a storage device 1116 (e.g., a drive unit), a signal generation device 1118 (e.g., a speaker), a network interface device 1120, and one or more sensors (not shown), such as a Global Positioning System (GPS) sensor, compass, accelerometer, or other sensor.

In some examples, the processor unit 1102 or another suitable hardware component may support a hardware interrupt. In response to a hardware interrupt, the processor unit 1102 may pause its processing and execute an ISR, for example, as described herein.

The storage device 1116 includes a machine-readable medium 1122 on which is stored one or more sets of data structures and instructions 1124 (e.g., software) embodying or used by any one or more of the methodologies or functions described herein. The instructions 1124 can also reside, completely or at least partially, within the main memory 1104, within the static memory 1106, and/or within the processor unit 1102 during execution thereof by the architecture 1100, with the main memory 1104, the static memory 1106, and the processor unit 1102 also constituting machine-readable media.

Executable Instructions and Machine-Storage Medium

The various memories (i.e., 1104, 1106, and/or memory of the processor unit(s) 1102) and/or the storage device 1116 may store one or more sets of instructions and data structures (e.g., the instructions 1124) embodying or used by any one or more of the methodologies or functions described herein. These instructions, when executed by the processor unit(s) 1102, cause various operations to implement the disclosed examples.

As used herein, the terms “machine-storage medium,” “device-storage medium,” and “computer-storage medium” (referred to collectively as “machine-storage medium”) mean the same thing and may be used interchangeably. The terms refer to a single or multiple storage devices and/or media (e.g., a centralized or distributed database, and/or associated caches and servers) that store executable instructions and/or data, as well as cloud-based storage systems or storage networks that include multiple storage apparatus or devices. The terms shall accordingly be taken to include, but not be limited to, solid-state memories, and optical and magnetic media, including memory internal or external to processors. Specific examples of machine-storage media, computer-storage media, and/or device-storage media include non-volatile memory, including by way of example semiconductor memory devices, e.g., erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), field-programmable gate array (FPGA), and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The terms “machine-storage media,” “computer-storage media,” and “device-storage media” specifically exclude carrier waves, modulated data signals, and other such media, at least some of which are covered under the term “signal medium” discussed below.

Signal Medium

The term “signal medium” or “transmission medium” shall be taken to include any form of modulated data signal, carrier wave, and so forth. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal.

Computer-Readable Medium

The terms “machine-readable medium,” “computer-readable medium” and “device-readable medium” mean the same thing and may be used interchangeably in this disclosure. The terms are defined to include both machine-storage media and signal media. Thus, the terms include both storage devices/media and carrier waves/modulated data signals.

The instructions 1124 can further be transmitted or received over a communications network 1126 using a transmission medium via the network interface device 1120 using any one of a number of well-known transfer protocols (e.g., Hypertext Transfer Protocol (HTTP)). Examples of communication networks include a local area network (LAN), a wide area network (WAN), the Internet, mobile telephone networks, plain old telephone service (POTS) networks, and wireless data networks (e.g., Wi-Fi, 3G, 4G Long-Term Evolution (LTE)/LTE-A, 5G, or WiMAX networks).

Throughout this specification, plural instances may implement components, operations, or structures described as a single instance. Although individual operations of one or more methods are illustrated and described as separate operations, one or more of the individual operations may be performed concurrently, and nothing requires that the operations be performed in the order illustrated. Structures and functionality presented as separate components in example configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements fall within the scope of the subject matter herein.

Various components are described in the present disclosure as being configured in a particular way. A component may be configured in any suitable manner. For example, a component that is or that includes a computing device may be configured with suitable software instructions that program the computing device. A component may also be configured by virtue of its hardware arrangement or in any other suitable manner.

The above description is intended to be illustrative, and not restrictive. For example, the above-described examples (or one or more aspects thereof) can be used in combination with others. Other examples can be used, such as by one of ordinary skill in the art upon reviewing the above description. The Abstract is to allow the reader to quickly ascertain the nature of the technical disclosure, for example, to comply with 37 C.F.R. § 1.72(b) in the United States of America. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

Also, in the above Detailed Description, various features can be grouped together to streamline the disclosure. However, the claims cannot set forth every feature disclosed herein, as examples can feature a subset of said features. Further, examples can include fewer features than those disclosed in a particular example. Thus, the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separate example. The scope of the examples disclosed herein is to be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled. 

1. A method for routing autonomous vehicles, the method comprising: accessing first routing graph modification data comprising a first graph element descriptor and a first constraint, the first routing graph modification data based at least in part on first vehicle capability data describing a first type of autonomous vehicle; accessing second routing graph modification data comprising a second graph element descriptor and a second constraint, the second routing graph modification data based at least in part on second vehicle capability data describing a second type of autonomous vehicle; accessing routing graph data describing a plurality of graph elements, the routing graph data comprising: a first graph element cost describing a first graph element of the plurality of graph elements and connectivity data describing at least one connection between the first graph element and a second graph element of the plurality of graph elements; generating a first route for a first autonomous vehicle of the first type, the generating of the first route based at least in part on the first routing graph modification data and the routing graph data; generating a second route for a second autonomous vehicle of the second type, the generating of the second route based at least in part on the second routing graph modification data and the routing graph data; and causing at least the first autonomous vehicle to begin traveling the first route.
 2. The method of claim 1, wherein the generating the first route comprising generating first constrained routing graph data based at least in part on the first routing graph modification data and the routing graph data.
 3. The method of claim 2, further comprising: generating a first portion of the first constrained routing graph data; determining a first portion of the first route based at least in part on the first portion of the first constrained routing graph data, the first portion of the first route including a first portion endpoint; and after determining the first portion of the first route, generating a second portion of the first constrained routing graph data, the second portion of the first constrained routing graph data describing at least one graph element of the plurality of graph elements having a connection to the first portion endpoint.
 4. The method of claim 2, wherein determining the first route comprises: after generating the first constrained routing graph data, determining a first portion of the first route, the first portion of the first route including a first portion end point; accessing a portion of the first constrained routing graph data that describes at least one graph element of the plurality of graph elements having a connection to the first portion end point; and determining a second portion of the first route based at least in part on the portion of the first constrained routing graph data.
 5. The method of claim 1, further comprising accessing roadway condition data describing a condition of at least one roadway element described by the routing graph data, wherein the first routing graph modification data is based at least in part on the roadway condition data.
 6. The method of claim 1, further comprising accessing business policy data describing a business policy applicable at least to autonomous vehicles of the first type, wherein the first routing graph modification data is based at least in part on the business policy data.
 7. The method of claim 1, wherein generating the first route comprises: determining that the first graph element meets the first graph element descriptor; and applying the first constraint to the first graph element.
 8. The method of claim 7, wherein applying the first constraint to the first graph element comprises increasing the first cost.
 9. The method of claim 7, wherein applying the first constraint to the first graph element comprises disabling the at least one connection between the first graph element and the second graph element.
 10. The method of claim 7, wherein applying the first constraint to the first graph element comprises storing an indication that a roadway element corresponding to the first graph element is to be traversed in a manual mode or a semi-autonomous mode.
 11. The method of claim 1, wherein causing the first autonomous vehicle to begin traveling the first route comprises: transmitting first route data describing the first route to the first autonomous vehicle; and transmitting to the first autonomous vehicle an instruction to begin traveling the first route.
 12. The method of claim 1, wherein causing the autonomous vehicle to begin traveling the first route comprises modifying at least one vehicle control of the autonomous vehicle.
 13. The method of claim 1, further comprising selecting the first autonomous vehicle to execute a transportation service based at least in part on the first route and the second route.
 14. A system for routing autonomous vehicles, the system comprising: at least one processor unit programmed to perform operations comprising: accessing first routing graph modification data comprising a first graph element descriptor and a first constraint, the first routing graph modification data based at least in part on first vehicle capability data describing a first type of autonomous vehicle; accessing second routing graph modification data comprising a second graph element descriptor and a second constraint, the second routing graph modification data based at least in part on second vehicle capability data describing a second type of autonomous vehicle; accessing routing graph data describing a plurality of graph elements, the routing graph data comprising: a first graph element cost describing a first graph element of the plurality of graph elements and connectivity data describing at least one connection between the first graph element and a second graph element of the plurality of graph elements; generating a first route for a first autonomous vehicle of the first type, the generating of the first route based at least in part on the first routing graph modification data and the routing graph data; generating a second route for a second autonomous vehicle of the second type, the generating of the second route based at least in part on the second routing graph modification data and the routing graph data; and causing at least the first autonomous vehicle to begin traveling the first route.
 15. The system of claim 14, wherein the generating the first route comprising generating first constrained routing graph data based at least in part on the first routing graph modification data and the routing graph data.
 16. The system of claim 15, the operations further comprising: generating a first portion of the first constrained routing graph data; determining a first portion of the first route based at least in part on the first portion of the first constrained routing graph data, the first portion of the first route including a first portion endpoint; and after determining the first portion of the first route, generating a second portion of the first constrained routing graph data, the second portion of the first constrained routing graph data describing at least one graph element of the plurality of graph elements having a connection to the first portion endpoint.
 17. The system of claim 15, wherein determining the first route comprises: after generating the first constrained routing graph data, determining a first portion of the first route, the first portion of the first route including a first portion end point; accessing a portion of the first constrained routing graph data that describes at least one graph element of the plurality of graph elements having a connection to the first portion end point; and determining a second portion of the first route based at least in part on the portion of the first constrained routing graph data.
 18. The system of claim 14, the operations further comprising accessing roadway condition data describing a condition of at least one roadway element described by the routing graph data, wherein the first routing graph modification data is based at least in part on the roadway condition data.
 19. The system of claim 14, the operations further comprising accessing business policy data describing a business policy applicable at least to autonomous vehicles of the first type, wherein the first routing graph modification data is based at least in part on the business policy data.
 20. A machine-readable medium comprising instructions stored thereon that, when executed by at least one processor unit, cause the at least one processor unit to perform operations comprising: accessing first routing graph modification data comprising a first graph element descriptor and a first constraint, the first routing graph modification data based at least in part on first vehicle capability data describing a first type of autonomous vehicle; accessing second routing graph modification data comprising a second graph element descriptor and a second constraint, the second routing graph modification data based at least in part on second vehicle capability data describing a second type of autonomous vehicle; accessing routing graph data describing a plurality of graph elements, the routing graph data comprising: a first graph element cost describing a first graph element of the plurality of graph elements and connectivity data describing at least one connection between the first graph element and a second graph element of the plurality of graph elements; generating a first route for a first autonomous vehicle of the first type, the generating of the first route based at least in part on the first routing graph modification data and the routing graph data; generating a second route for a second autonomous vehicle of the second type, the generating of the second route based at least in part on the second routing graph modification data and the routing graph data; and causing at least the first autonomous vehicle to begin traveling the first route. 